The complete solution to the Sylvester-polynomial-conjugate matrix equations
نویسندگان
چکیده
منابع مشابه
On the numerical solution of generalized Sylvester matrix equations
The global FOM and GMRES algorithms are among the effective methods to solve Sylvester matrix equations. In this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two CG-type algorithms for solving generalized Sylvester matrix equations. The proposed methods are iterative projection metho...
متن کاملThe polynomial solution to the Sylvester matrix equation
For when the Sylvester matrix equation has a unique solution, this work provides a closed form solution, which is expressed as a polynomial of known matrices. In the case of non-uniqueness, the solution set of the Sylvester matrix equation is a subset of that of a deduced equation, which is a system of linear algebraic equations. c © 2005 Elsevier Ltd. All rights reserved.
متن کاملPolynomial Solution of Sylvester Matrix Equation
where X ∈ M(n,m)(K), play a central role in many areas of applied mathematics and in particular in systems and control theory. It is well known that if K is an algebraically closed field then the matrix equation (1) possesses a unique solution if and only if the matrices A and B have no common eigenvalues (see [[3]] and [11]). In this work we give a brief survey of methods used to solve the (SM...
متن کاملon the numerical solution of generalized sylvester matrix equations
the global fom and gmres algorithms are among the effective methods to solve sylvester matrix equations. in this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two cg-type algorithms for solving generalized sylvester matrix equations. the proposed methods are iterative projection metho...
متن کاملOn the Numerical Solution of Generalized Sylvester Matrix Equations
The global FOM and GMRES algorithms are among the effective methods to solve Sylvester matrix equations. In this paper, we study these algorithms in the case that the coefficient matrices are real symmetric (real symmetric positive definite) and extract two CG-type algorithms for solving generalized Sylvester matrix equations. The proposed methods are iterative projection methods onto matrix Kr...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2011
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2010.12.038